Solve Traveling Salesman Problem Using Particle Swarm Optimization Algorithm
نویسندگان
چکیده
The traveling salesman problem (TSP) is one of the most widely studied NP-hard combinatorial optimization problems and traditional genetic algorithm trapped into the local minimum easily for solving this problem. Particle Swarm Optimization (PSO) algorithm was developed under the inspiration of behavior laws of bird flocks, fish schools and human communities. Compared with the genetic algorithm, PSO algorithm has high convergence speed. In this paper, aim at the disadvantages of genetic algorithm like being trapped easily into a local optimum, we use the PSO algorithm to solve the TSP and the experiment results show the new algorithm is effective for the this problem.
منابع مشابه
Solving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملParticle swarm optimization-based algorithms for TSP and generalized TSP
A novel particle swarm optimization (PSO)-based algorithm for the traveling salesman problem (TSP) is presented. An uncertain searching strategy and a crossover eliminated technique are used to accelerate the convergence speed. Compared with the existing algorithms for solving TSP using swarm intelligence, it has been shown that the size of the solved problems could be increased by using the pr...
متن کاملStudy of Pseudo-Parallel Genetic Algorithm with Ant Colony Optimization to Solve the TSP
The traveling salesman problem (TSP) has attracted many researchers’ attention in the past few decades, and amounts of algorithms based on heuristic algorithms, genetic algorithms, particle swarm optimization, tabu search and memetic algorithms have been presented to solve it, respectively. Unfortunately, their results have not been satisfied at all yet. This paper is devoted to the presentatio...
متن کاملStudying Solutions of Traveling Salesman Problem with Hybrid Particle Swarm Optimization
This paper presents the application of the PSO (Particle Swarm Optimization) as a tool to solve the Traveling Salesman Problem. The proposed application consists of using a technique based on Artificial Intelligent – AI. It is based in the simulation of social interaction between individuals of a population. Here, each element of population moves in the hyper-space and they are attracted by pos...
متن کامل